Generation Algorithms Of Fast Generalized Hough Transform
نویسندگان
چکیده
In this paper we investigate the problem of finding the minimal operations number for the generalized Hough transform computation (GHT). We demonstrate that this problem is equivalent to the addition chain problem and is therefore NP-complete. Three greedy methods for generating GHT computation algorithms are proposed and their performance is compared against the fast Hough transform (FHT) for different discrete straight line pattern types. The additional result of this work is the experimental proof of the FHT non-optimality.
منابع مشابه
U . S . Patent Jul . 3 , 2007 Sheet 2 of 10 AI - - - - d US 7 , 239 , 751 B 1
Iso, Jiang et al., “A fast approach to the detection and correction of skew documents,” Pattern Recognition Letters, Vol. 18, pp. 675-686 (1997). Avanindra et al., “Robust detection of skew in documented images,” IEEE Trans. Image Processing, vol. 6, pp. 344-349, Feb. 1997. Wallack and Maocha, Robust Algorithms for Object Localizaiton. International Journal of Computer Vision, 27(3):243-262, 19...
متن کاملImage matching under generalized hough transform
The paper analyzes the techniques of image template matching, and gives a matching framework based on generalized Hough transform, which is applicable to lots of current methods. With the framework’s guidance, extracting image features with specific characteristics and devising feature matching algorithms become easier and more efficient. We propose a new fast matching algorithm as evidence. It...
متن کاملFast generalized Hough transform
A fast algorithm for the generalized Hough transform (GHT) based on the use of a hierarchical processing scheme and the inverse generalized Hough operation is proposed. By reducing the size of the image portion which need be processed in the proposed fast GHT, not only the computation time but also the number of processing elements for parallel processing can be reduced. The way to apply the pr...
متن کاملRandomized generalized Hough transform for 2-D gray scale object detection
This paper proposes a new algorithm for 2-D object detection called Randomized Generalized Hough Transform (RGHT). It combines the Generalized Hough Transform (GHT) with the Randomized Hough Transform (RHT). Our algorithm can detect arbitrary objects of various scales and orientations in graylevel images. We also demonstrate RGHT’s advantage of high speed, low storage requirement, high accuracy...
متن کاملA Fast Randomized Generalized Hough Transform for Arbitrary Shape Detection
The well-known arbitrary shape detection technology, generalized Hough transform (GHT) has the drawbacks of heavy computations (one-to-many or 1-to-n mapping) and storage requirements (voting space and entry number). Some n-to-1 mapping approaches have been proposed for improving the performance of GHT, such as the FGHT (fast generalized Hough transform), ADPHT (Adaptive dual-point Hough transf...
متن کامل